Modification of peer-to-peer based feature network based on changing conditions / session signaling

ABSTRACT

A device communicates with feature peers, associated with a network, to obtain information associated with the feature peers, and receives a customer packet that includes a feature header. The device also modifies, based on the feature peer information, current condition state signaling, and other information, the feature header to create a modified customer packet, and determines, based on the feature peer information, the current condition state signaling, and the other information, which of the feature peers support a feature associated with the modified customer packet. The device further selects, from the determined feature peers, a set of feature peers for the modified customer packet to traverse, and forwards, based on the modified feature header, the modified customer packet to one of the feature peers in the selected set of feature peers.

BACKGROUND

Some networks (e.g., telecommunications networks, the Internet, etc.)provide packet and/or content forwarding services and/or features.Examples of such packet/content forwarding services/features includecontent-related services (e.g., voice, audio, and/or video transcoding;bridging; replication; etc.); security-related services (e.g.,network-based firewalls and/or application layer gateways; intrusiondetection, prevention, and/or mitigation; denial of service detection,prevention, and/or mitigation; etc.); flow, rate, and quality of service(QoS)-related services (e.g., metering; policing; shaping; scheduling;coordination with higher-level signaling, policy, and configuration;etc.); accounting-related services (e.g., usage cap metering,notification, and/or enforcement; billing; etc.); administrative-relatedservices (e.g., selective packet set capture, replication, redirection,and/or blocking; packet inspection; etc.); etc.

Such packet/content forwarding services/features may be managed via a“star” or “flower” network centered on a router (or feature switch). Inthe star/flower arrangement, traffic to/from a user (e.g., of a serviceor feature) is directed into a set of feature peers by therouter/feature switch. Such an arrangement may require configuration ofthe router, use of tunnels, and load balancing, and may result insub-optimal performance.

In one exemplary star/flower arrangement, a network management system(NMS) provisions an access control list (ACL) (e.g., of an accessrouter) to map customer packets to routing logic, and provisions arouting table (e.g., of the access router) to determine mapping of afeature chain to a sequence of tunnels associated with a server for each(set of) features. The NMS also provisions feature servers with tunneland subscriber information consistent with the provisioning of theaccess router. The access router determines data network information(e.g., Internet protocol (IP) interior gateway protocol (IGP)/bordergateway protocol (BGP), virtual private network (VPN) multiprotocol(MP)-BGP, Ethernet address resolution protocol (ARP), etc.), andreceives a packet from a customer (e.g., from a device associated withthe customer). The access router uses the ACL to determine that thepacket includes subscribed to features and directs the packet to therouting table to determine a tunnel next hop associated with a serverfor a first features. The first feature server returns the packet to theaccess router. The access router then uses the routing table to sequencethe packet through a chain of tunnels configured to reach each featureserver in the chain, which then return the packets to the same accessrouter, as configured by the NMS. Finally, the access router also usesthe routing table to determine when the packet has exited from the lastfeature server in the chain, to decapsulate the packet from the tunnel,and to direct the packet to an original destination address. The accessrouter then forwards the packet, via the data network, towards thedestination address. A similar process occurs in the reverse directionfor a packet received from the network (e.g., the Internet) that isdestined for a particular subscriber.

However, the star/flower arrangement is expensive because, although itrequires no changes to the software and/or hardware of the accessrouter, the routers and switches are traversed twice between eachfeature server and the access router that connects to a user. In thestar/flower arrangement, there needs to be a tunnel for each featureserver per feature chain since a tunnel identification (ID) determines anext feature server or exit to the data network. Furthermore, thestar/flower arrangement can increase latency if the feature servers arenot near the access router that connects to the user. The star/flowerarrangement requires a static configuration, in the router, of tunnelIDs and next hops; is not resilient (e.g., load balancing across thefeature servers requires reconfiguration); and makes it difficult torepresent more complex feature topologies than a chain topology.

Packet/content forwarding services/features may also be managed via aservice header-based routing arrangement. In one exemplary serviceheader-based routing arrangement, an access router registers with aservice broker, and the service broker provisions an ACL (e.g., of theaccess router) to map customer packets to a service routing function(e.g., associated with the access router). The service broker provisionsservice nodes with service header, tunnel, network, and subscriberinformation consistent with provisioning of the service routing functionfor the access router in the network. The access router determines datanetwork information (e.g., IP IGP/BGP, VPN MP-BGP, Ethernet ARP, etc.),and receives a packet from a customer (e.g., from a device associatedwith the customer). The access router uses the ACL to determine that thepacket includes subscribed to services and directs the packet to theservice routing function. The service routing function uses localconfiguration and packet information to determine a service header to beinserted, encapsulates this within a tunnel header, and forwards thepacket to a first service node over the tunnel. The service nodedecapsulates the packet from the tunnel, reviews the service header andconfigured information from the service broker to determine an outgoingtunnel, and forwards the packet to the next service node. Eventually,the packet returns to the access router that originally received thepacket (e.g., in the case where a service topology is a chain). Theservice routing function (e.g., of the access router) decapsulates thepacket from the tunnel, examines the service header, and determines thatthe next step is forwarding. The access router then forwards the packet,via the data network, toward a destination address. A similar processoccurs in the reverse direction for a packet received from the network(e.g., the Internet) that is destined for a particular subscriber.

The star/flower arrangement and the service header-based routingarrangement require expensive changes to the software and/or hardware ofthe access router in order to implement the service header insertion andprocessing. The service header-based routing arrangement relies on acentralized service broker to determine, download, and monitor state,and to optimize and load balance service node level routing across whatcould grow to be a very large set of service nodes. Centralization maylimit a convergence time and responsiveness to change associated withthe arrangement. Furthermore, the service header-based routingarrangement requires fault detection and restoration performance to bedetermined by the centralized service broker, and may not be implementedacross more than one service provider.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram of an exemplary network in which systems and/ormethods described herein may be implemented;

FIG. 2 is a diagram of exemplary components of a device that maycorrespond to one of the devices of the network depicted in FIG. 1;

FIGS. 3A-3C are diagrams of exemplary interactions among components ofan exemplary portion of the network depicted in FIG. 1;

FIGS. 4A and 4B are diagrams of exemplary interactions among componentsof another exemplary portion of the network depicted in FIG. 1; and

FIGS. 5-8 are flow charts of an exemplary process for modifying apeer-to-peer based feature network according to implementationsdescribed herein.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

The following detailed description refers to the accompanying drawings.The same reference numbers in different drawings may identify the sameor similar elements. Also, the following detailed description does notlimit the invention.

Implementations described herein may include systems and/or methods thatmay modify a peer-to-peer based feature network based on changingconditions and/or session signaling. For example, in one implementation,a feature peer (e.g., a server that provides features and/or services,such as content-related services, security-related services, etc.) maycommunicate with other feature peers to obtain information associatedwith the other feature peers, which may or may not be associated with areceived packet (e.g., from a user or customer) that includes a featureheader. The feature peer may modify the feature header, based on theinformation associated with the other feature peers, to create amodified customer packet. The feature peer may determine, based on thefeature peer information, which of the other feature peers can support afeature associated with the modified customer packet. The feature peermay select a set of the other feature peers, from the determined otherfeature peers, for the modified customer packet to traverse. The featurepeer may forward, based on the modified feature header, the modifiedcustomer packet to one of the feature peers in the set of other featurepeers.

As used herein, the terms “user,” “customer,” and “subscriber,” areintended to be broadly interpreted to include a user device and/or auser application or a user of a user device and/or a user application. Auser application may include any operating system software and/orapplication software that make use of features and may be executed by auser device.

FIG. 1 is a diagram of an exemplary network 100 in which systems and/ormethods described herein may be implemented. As illustrated, network 100may include a user device (UD) 110, an access router (AR) 120, a networkmanagement system (NMS) 130, feature peers (FPs) 150-1, . . . , 150-4(referred to collectively as “feature peers 150” or singularly as“feature peer 150”), and an application network (AN) server 160interconnected by a network 140. Components of network 100 mayinterconnect via wired and/or wireless connections. Four feature peers150 and a single user device 110, access router 120, NMS 130, network140, and AN server 160 have been illustrated in FIG. 1 for simplicity.In practice, there may be more user devices 110, access routers 120,NMSs 130, networks 140, feature peers 150, and/or AN servers 160. Also,in some instances, one or more of the components of network 100 mayperform one or more functions described as being performed by anotherone or more of the components of network 100.

User device 110 may include a radiotelephone, a personal communicationssystem (PCS) terminal (e.g., that may combine a cellular radiotelephonewith data processing and data communications capabilities), a wirelesstelephone, a cellular telephone, a smart phone, a personal digitalassistant (PDA) (e.g., that can include a radiotelephone, a pager,Internet/intranet access, etc.), a laptop computer (e.g., with abroadband air card), a personal computer, a landline telephone, or othertypes of computation or communication devices. In an exemplaryimplementation, user device 110 may include a device that is capable ofaccessing features and/or services (e.g., content-related services;security-related services; flow, rate, and QoS-related services;accounting-related services; administrative-related services; etc.)provided by the other components of network 100.

Access router 120 may include one or more data transfer devices (ornetwork devices), such as a gateway, a router, a switch, a firewall, anetwork interface card (NIC), a hub, a bridge, a proxy server, anoptical add-drop multiplexer (OADM), or some other type of device thatprocesses and/or transfers data. In one exemplary implementation, accessrouter 120 may enable user device 110 to access features and/or services(e.g., content-related services; security-related services; flow, rate,and QoS-related services; accounting-related services;administrative-related services; etc.) provided by feature peers 150.

NMS 130 may include one or more server devices, or other types ofcomputation or communication devices, that gather, process, search,and/or provide information in a manner described herein. In an exemplaryimplementation, NMS 130 may monitor and administer a network, such asnetwork 100.

Network 140 may include a local area network (LAN), a wide area network(WAN), a metropolitan area network (MAN), a telephone network, such asthe Public Switched Telephone Network (PSTN), a cellular network, aWi-Fi network, an intranet, a virtual private network (VPN), theInternet, an optical fiber (or fiber optic)-based network, or acombination of networks. In one exemplary implementation, network 140may include a peer to peer (P2P)-based feature network that supportsfeatures and/or services provided by feature peers 150.

Feature peer 150 may include one or more server devices, or other typesof computation or communication devices, that gather, process, search,and/or provide information in a manner described herein. In an exemplaryimplementation, feature peer 150 may communicate with other featurepeers 150 to obtain information associated with the other feature peers150, and may receive a customer packet (e.g., from user device 110 andvia access router 120) that includes a feature header. Feature peer 150may modify the feature header, based on the information associated withthe other feature peers 150, to create a modified customer packet.Feature peer 150 may determine, based on the feature peer information,which of the other feature peers 150 can support a feature associatedwith the modified customer packet. Feature peer 150 may select a set ofthe other feature peers 150, from the determined other feature peers150, for the modified customer packet to traverse. Feature peer 150 mayforward, based on the modified feature header, the modified customerpacket to one of feature peers 150 in the set of other feature peers150. Further details of feature peers 150 are provided below inconnection with, for example, FIGS. 3A-4B.

AN server 160 may include one or more server devices, or other types ofcomputation or communication devices, that gather, process, search,and/or provide information in a manner described herein. In an exemplaryimplementation, AN server 160 may communicate with feature peers 150,and may perform (e.g., on feature peers 150) functions, such as topologymapping to minimize cost and/or achieve optimal performance, and loadbalancing to balance loads on feature peers 150.

Although FIG. 1 shows exemplary components (e.g., devices) of network100, in other implementations, network 100 may contain fewer, different,differently arranged, or additional components than depicted in FIG. 1.

FIG. 2 is an exemplary diagram of a device 200 that may correspond toone or more of user device 110, access router 120, NMS 130, featurepeers 150, or AN server 160. As illustrated, device 200 may include abus 210, a processing unit 220, a main memory 230, a read-only memory(ROM) 240, a storage device 250, an input device 260, an output device270, and/or a communication interface 280. Bus 210 may include a paththat permits communication among the components of device 200.

Processing unit 220 may include one or more processors, microprocessors,or other types of processing units that may interpret and executeinstructions. Main memory 230 may include a random access memory (RAM)or another type of dynamic storage device that may store information andinstructions for execution by processing unit 220. ROM 240 may include aROM device or another type of static storage device that may storestatic information and/or instructions for use by processing unit 220.Storage device 250 may include a magnetic and/or optical recordingmedium and its corresponding drive.

Input device 260 may include a mechanism that permits an operator toinput information to device 200, such as a keyboard, a mouse, a pen, amicrophone, voice recognition and/or biometric mechanisms, etc. Outputdevice 270 may include a mechanism that outputs information to theoperator, including a display, a printer, a speaker, etc. Communicationinterface 280 may include any transceiver-like mechanism that enablesdevice 200 to communicate with other devices and/or systems. Forexample, communication interface 280 may include mechanisms forcommunicating with another device or system via a network.

As described herein, device 200 may perform certain operations inresponse to processing unit 220 executing software instructionscontained in a computer-readable medium, such as main memory 230. Acomputer-readable medium may be defined as a physical or logical memorydevice. A logical memory device may include memory space within a singlephysical memory device or spread across multiple physical memorydevices. The software instructions may be read into main memory 230 fromanother computer-readable medium, such as storage device 250, or fromanother device via communication interface 280. The softwareinstructions contained in main memory 230 may cause processing unit 220to perform processes described herein. Alternatively, hardwiredcircuitry may be used in place of or in combination with softwareinstructions to implement processes described herein. Thus,implementations described herein are not limited to any specificcombination of hardware circuitry and software. In one example, thesoftware instructions may include any operating system software and/orapplication software that make use of features.

Although FIG. 2 shows exemplary components of device 200, in otherimplementations, device 200 may contain fewer, different, differentlyarranged, or additional components than depicted in FIG. 2. In stillother implementations, one or more components of device 200 may performone or more other tasks described as being performed by one or moreother components of device 200.

FIGS. 3A-3C are diagrams of exemplary interactions among components ofan exemplary portion 300 of network 100. As illustrated, exemplarynetwork portion 300 may include user device 110, access router 120, NMS130, network 140, feature peers 150, and AN server 160. User device 110,access router 120, NMS 130, network 140, feature peers 150, and/or ANserver 160 may include the features described above in connection with,for example, FIGS. 1 and 2.

As further shown in FIG. 3A, access router 120 may include an accesscontrol list (ACL) table 302, an address forwarding lookup (AFL) table304, and a routing table 306. In one exemplary implementation, ACL table302, AFL table 304, and routing table 306 may be provided in one or morememory devices (e.g., main memory 230, ROM 240, and/or storage device250) associated with access router 120.

ACL table 302 may include a table of entries that map an NMS-provisionedIP source address (SA) of a packet (e.g., received from user device 110)to a tunnel header associated with a tunnel on which the packet may berouted to a feature peer. In one example, ACL table 302 may include anIP SA field, a tunnel header field, and a variety of entries associatedwith the IP SA field and the tunnel header field. Further details of ACLtable 302 are provided below in connection with, for example, FIG. 4A.

AFL table 304 may include a table of entries that map an IP destinationaddress (DA) of a packet (e.g., received from network 140) with a nexthop (e.g., device) to which the packet may be routed. In one example,AFL table 304 may include an IP DA field, a next hop field, and avariety of entries associated with the IP DA field and the next hopfield. Further details of AFL table 304 are provided below in connectionwith, for example, FIGS. 4A and 4B.

Routing table 306 may include a table of entries that provide routinginformation for a packet received by access router 120 (e.g., from userdevice 110). In one example, routing table 306 may be configured by NMS130 to forward a packet on specific tunnel (e.g., using a tunnel header)to a first feature peer (e.g., feature peer 150-1). In another example,routing table 306 may be used to automatically discover addresses andnext hops of feature peers and to automatically populate AFL table 304.

As further shown in FIG. 3A, NMS 130 may provide provisioninginformation 308 to ACL table 302, AFL table 304, and routing table 306.Provisioning information 308 may include information that enables accessrouter 120 to handle packets received from user device 110 and/orprovided to user device 110. In one example, provisioning information308 may instruct ACL table 302 to map customer packets (e.g., receivedfrom an SA received from user device 110) to AFL table 304 usinginformation obtained from routing table 306. AFL table 304 and routingtable 306 may include a mapping to a tunnel for a first feature peer 150if the customer subscribes to a peer-to-peer based feature networkforwarding service (e.g., provided by network 100).

NMS 130 may provision feature peers 150 with feature information 310 andmay provision a first feature peer (e.g., feature peer 150-1) withfeature information 310 and subscriber information 312. Featureinformation 310 may include feature software (e.g., software thatenables feature peers 150 to provide features and/or services, such ascontent-related services; security-related services; flow, rate, andQoS-related services; accounting-related services;administrative-related services; etc.); a feature net representation(e.g., a graph of feature peers 150 through which a packet may berouted); registration information; authentication information; loadbalancing and backup feature peer information; etc. Subscriberinformation 312 may include information associated with subscribers tofeatures and/or services (e.g., content-related services,security-related services, etc.) provided by network 100. NMS 130 mayperiodically provide feature information 310 to feature peers 150 or mayprovide feature information 310 to feature peers 150 based on conditions(e.g., in response to a trigger) associated with network 140 and/orfeature peers 150.

As further shown in FIG. 3A, routing table 306 of access router 120 mayretrieve network routing protocol information 313 from network 140.Network information 313 may include IP IGP/BGP information, VPN MP-BGPinformation, Ethernet ARP information, etc. associated with network 140.Routing table 306 may use network information 313 to automaticallypopulate AFL table 304 with forwarding information. In this way,information about a change in network topology related to feature peers150 (e.g., a routing metric, a routing preference, or a failure may beused to automatically update forwarding information). AN server 160 mayprovide mapping/balancing information 314 to feature peers 150.Mapping/balancing information 314 may include information that providestopology mapping for feature peers 150 (e.g., to minimize cost andachieve optimal performance), and information that enables loads onfeature peers 150 to be balanced so that one or more feature peers 150do not become overloaded (e.g., with traffic). An alternative tocommunication with a logically centralized AN server 160 may includeusing pairs of feature servers to communicate load and active statusamongst smaller sets of nodes to improve convergence time (e.g., usingthe procedure depicted in FIG. 3B).

As shown in FIG. 3B, feature peers 150 may communicate with each otherto provide feature peer information 316 to other feature peers 150.Feature peer information 316 may include identification information;load information; path information; active/inactive status information;session signaling (e.g., signaling message packets 318 communicatedbetween other parties (e.g., a session initiation protocol (SIP) useragent and a SIP server) intercepted for processing by a feature peer,and/or signaling provided between feature peers 150 during provisioningof packet 318); policy information (e.g., information associated withpolicies, such as usage policies, bandwidth allocations, etc.); databaseinformation (e.g., information contained in databases of feature peers150, sizes of such databases, etc.); etc. associated with feature peers150; and subscriber information (e.g., information associated withcustomers or subscribers to peer-to-peer based feature networkforwarding). Feature peer information 316 may enable feature peers 150to define a set of feature net logic (e.g., a set of feature peers 150)that may be dynamically determined and self correcting. In one exemplaryimplementation, feature peers 150 may communicate with each other usingdistributed hash tables (DHTs) to locate appropriate feature peers 150based on a key (e.g., provided via feature peer information 316) thatincludes a feature peer ID, a subscriber ID range, feature information,a customer ID, IP source/destination addresses, etc. In anotherexemplary implementation, feature peers 150 may use P2P communication toprovide event-driven (or periodic) updated subscriber and featurerelated information that need not be forwarded via a packet header.

As further shown in FIG. 3B, a packet 318 from a customer (e.g., userdevice 110) may be provided to access router 120 (e.g., to ACL table 302of access router 120). Packet 318 may include an IP header (IPH) 320 anda payload (PL) 322. IPH 320 may provide an address associated with userdevice 110. PL 322 may include information associated with featuresand/or services (e.g., content-related services, security-relatedservices, flow, rate, and QoS-related services, accounting-relatedservices, administrative-related services, etc.) provided by featurepeers 150. ACL table 302 may receive packet 318, may determine thatpacket 318 is associated with subscribed to services and/or features,and may direct packet 318 to AFL table 304, as indicated by referencenumber 324.

AFL table 304 may be configured (e.g., via provisioning information 308)by NMS 130 to forward a packet on a specific tunnel 326 (e.g., using atunnel header) to a first feature peer (e.g., feature peer 150-1) or maybe automatically configured by routing table 306. AFL table 304 mayprovide a tunnel header 328 (e.g., which defines tunnel 326 to featurepeer 150-1) in packet 318, and may forward packet 318, (e.g., usingtunnel header 328) along tunnel 326 to feature peer 150-1. In oneexemplary implementation, routing table 306 operating in conjunctionwith AFL table 304 may utilize mechanisms (e.g., anycast mechanisms,link aggregation groups (LAGs)) for providing resiliency and loadbalancing to feature peers 150. Feature peer 150-1 may receive packet318.

With reference to FIG. 3C, feature peer 150-1 may determine (e.g., basedon feature peer information 316) which of feature peers 150-2, 150-3,and 150-4 can support a feature associated with packet 318 (e.g., afeature set forth in PL 322 of packet 318). Feature peer 150-1 maydetermine subscriber information associated with packet 318, and mayselect a set of feature peers 150 (e.g., from feature peers 150determined to support the feature associated with packet 318) for packet318 to traverse. In one exemplary implementation, feature peer 150-1 mayrank feature peers 150, determined to support the feature associatedwith packet 318, based on feature peer information 316. For example,feature peer 150-1 may rank feature peers 150 with smaller loads higherthan feature peers 150 with greater loads. Feature peer 150-1 may selectthe set of feature peers 150 (e.g., from the ranked feature peers 150determined to support the feature associated with packet 318) based onthe rankings Packet 318 may be provided to the other feature peers 150in the set of feature peers 150, may be returned to access router 120,and/or may be forwarded on to its destination address (e.g., provided innetwork 140).

For example, feature peer 150-1 may alter a tunnel header (e.g., tunnelheader 328) of packet 318. Tunnel header 328 may be altered to define atunnel 332 to a next feature peer (e.g., feature peer 150-2) to which toprovide packet 318. Feature peer 150-1 may modify packet 318 by adding afeature header 334-1 to packet 318, and may forward the modified packet318 to feature peer 150-2 (e.g., via tunnel 332). Feature header 334-1may include a feature net ID, the subscriber information associated withpacket 318, an address associated with access router 120, etc.

Feature peer 150-2 may receive the modified packet 318 from feature peer150-1, and may decapsulate packet 318 from tunnel 332. Feature peer150-2 may determine (e.g., based on feature peer information 316) whichof the other feature peers 150 can support a feature associated withpacket 318 (e.g., a feature set forth in PL 322 of packet 318). Featurepeer 150-2 may determine subscriber information associated with packet318, and may select a set of feature peers 150 (e.g., from feature peers150 determined to support the feature associated with packet 318) forpacket 318 to traverse. Feature peer 150-2 may inspect feature header334-1 and feature information 310 (e.g., provided by NMS 130 or byfeature peer information 316) to determine feature processing optionsand a next feature peer (e.g., feature peer 150-3) to which to providepacket 318. Feature peer 150-2 may alter a tunnel header (e.g., tunnelheader 328) of packet 318. Tunnel header 328 may be altered to define atunnel 336 to the next feature peer (e.g., feature peer 150-3), and mayforward the modified packet 318 to feature peer 150-3 (e.g., via tunnel336).

As further show in FIG. 3C, feature peer 150-2 may modify feature header334-1 based on feature information 310 and/or feature peer information316 to create a modified feature header 334-2 and the modified customerpacket 318. In an exemplary implementation, feature peer 150-2 maymodify feature header 334-1 (e.g., to create feature header 334-2) basedon changing conditions and/or session signaling associated with otherfeature peers 150. For example, a feature peer 150 defined by featureheader 334-1 may experience load changes or may fail. Alternatively,another feature peer 150 (e.g., not defined by feature header 334-1) maybetter serve packet 318 (e.g., due to changing conditions) than afeature peer 150 initially defined by feature header 334-1. In suchsituations, feature peer 150-2 may modify tunnel header 328 (e.g., tocreate feature header 334-2) so that a failed or overloaded feature peer150 is not traversed by packet 318 or so that another feature peer 150(e.g., not defined by tunnel header 328) is traversed by packet 318. Inother situations, session signaling may result in a change of sessionstate (e.g., a voice or video over IP session being established orreleased) or conditions may change as a result of packet volume, type,or rate (e.g., the packet rate exceeds that provisioned by NMS 130). Inthese other situations, feature peer 150-2 may modify feature header334-1 (e.g., to create feature header 334-2) so that different featureprocessing (e.g., a different QoS is provided for packets that exceedNMS 130 provisioned packet rate) may be performed by the next featurepeer 150-3 on packet 318.

In another exemplary implementation, feature peer 150-2 may modifyfeature header 334-1 (e.g., to create feature header 334-2) based onsession signaling associated with other feature peers 150. For example,if a particular feature peer 150 (e.g., feature peer 150-2) defined byfeature header 334-1 detects a change in session state from interceptedsession signaling, feature peer 150-2 may modify feature header 334-1(e.g., to create feature header 334-2) to reflect the change in sessionstate. All feature peers 150 in the feature net graph may then be awareof this change in session state and may modify their feature processingaccordingly.

Feature peer 150-3 may receive the modified packet 318 from feature peer150-2, and may decapsulate packet 318 from tunnel 336. Feature peer150-3 may determine (e.g., based on feature peer information 316) whichof the other feature peers 150 can support a feature associated withpacket 318 (e.g., a feature set forth in PL 322 of packet 318). Featurepeer 150-3 may determine subscriber information associated with packet318, and may select a set of feature peers 150 (e.g., from feature peers150 determined to support the feature associated with packet 318) forpacket 318 to traverse. Feature peer 150-3 may inspect feature header334-2 and feature information 310 (e.g., provided by NMS 130 or byfeature peer information 316) to determine feature processing optionsand a next feature peer (e.g., feature peer 150-4) to which to providepacket 318. Feature peer 150-3 may alter a tunnel header (e.g., tunnelheader 328) of packet 318. Tunnel header 328 may be altered to define atunnel 338 to the next feature peer (e.g., feature peer 150-4), and mayforward the modified packet 318 to feature peer 150-4 (e.g., via tunnel338).

As further show in FIG. 3C, feature peer 150-3 may modify feature header334-2 based on feature information 310 and/or feature peer information316 to create a modified feature header 334-3 and the modified customerpacket 318. In an exemplary implementation, feature peer 150-3 maymodify feature header 334-2 (e.g., to create feature header 334-3) basedon changing conditions associated with other feature peers 150. Forexample, a feature peer 150 defined by feature header 334-2 mayexperience load changes or may fail. Alternatively, another feature peer150 (e.g., not defined by feature header 334-2) may better serve packet318 (e.g., due to changing conditions) than a feature peer 150 definedby feature header 334-2. In such situations, feature peer 150-3 maymodify tunnel header 328 (e.g., to create feature header 334-3) so thata failed or overloaded feature peer 150 is not traversed by packet 318or so that another feature peer 150 (e.g., not defined by tunnel header328) is traversed by packet 318. In other situations, session signalingmay result in a change of session state (e.g., a voice or video over IPsession being established or released) or conditions may change as aresult of packet volume, type, or rate (e.g., the packet rate exceedsthat provisioned by NMS 130). In these other situations, feature peer150-3 may modify feature header 334-2 (e.g., to create feature header334-3) so that different feature processing (e.g., a different QoS isprovided for packets that exceed NMS 130 provisioned packet rate) may beperformed by the next feature peer 150-4 on packet 318.

In another exemplary implementation, feature peer 150-3 may modifyfeature header 334-2 (e.g., to create feature header 334-3) based onsession signaling associated with other feature peers 150. For example,if a particular feature peer 150 (e.g. feature peer 150-3) defined byfeature header 334-2 detects a change in session state from interceptedsession signaling, feature peer 150-3 may modify feature header 334-2(e.g., to create feature header 334-3) to reflect the change in sessionstate. All feature peers 150 in the feature net graph may then be awareof this change in session state and may modify their feature processingaccordingly. In another example, feature peer 150-3 may determine thatan order in which packet 318 is to traverse feature peers 150 (e.g., asdefined by feature header 334-2) may be need to modified (e.g., based onchanging conditions). Feature peer 150-3 may modify feature header 334-2(e.g., to create feature header 334-3) to change the order in whichpacket 318 traverses feature peers 150 defined by feature header 334-2.In effect, the changed feature header 334-2 may reference a differentfeature net that has feature peers 150 ordered in a different way.Alternatively, modification of feature header 334-2 may effectivelyreference a different feature net that has more or fewer feature peers150 than that invoked for other packets. This means that each packetto/from a user device may receive different feature peer processing.

Feature peer 150-4 may receive the modified packet 318 from feature peer150-3, and may decapsulate packet 318 from tunnel 338. Feature peer150-4 may inspect feature header 334-3 and feature information 310(e.g., provided by NMS 130) to determine feature processing options.Feature peer 150-4 may determine that it is the last feature peer 150 ina feature graph (e.g., a path traversed by packet 318), and maydetermine that packet 318 is to be returned to its origination point(e.g., to access router 120, FIG. 3A). Feature peer 150-4 may use theaddress associated with access router 120 (e.g., as provided in featureheader 334-1) to define a tunnel 340 to access router 120. Feature peer150-4 may alter a tunnel header (e.g., tunnel header 328) of packet 318,and may remove feature header 334-3 from packet 318. Tunnel header 328may be altered to define tunnel 340 to access router 120, and mayforward packet 318 to access router 120 (e.g., via tunnel 340).

Access router 120 (e.g., AFL table 304) may receive packet 318 fromfeature peer 150-4, and may decapsulate packet 318 from tunnel 340. AFLtable 304 may use IPH 320 to determine a next hop for packet 318, andmay forward (e.g., via a tunnel 342) packet 318 to a destination addressassociated with network 140, as indicated by reference number 344.

Although FIGS. 3A-3C depict a chain or loop feature graph (e.g., packet318 travels via feature peers 150-1, 150-2, 150-3, and 150-4) forrouting packet 318, in other exemplary implementations, different typesof feature graphs may be used for routing packet 318 (e.g., a decisiontree feature graph, a feature graph that traverses feature peers 150-1and 150-4, etc.). In one exemplary implementation, packet 318 may not bereturned to access router 120 for forwarding on to the destinationaddress associated with network 140, but rather packet 318 may beforwarded (or may be dropped) by any of feature peers 150 (e.g.,provided in the feature graph). Furthermore, although FIGS. 3A-3C depictpacket 318 being provided by user device 110, the implementationsdescribed herein may be applied to a packet provided by network 140 anddestined for user device 110. Alternatively, a copy of packet 318 may becreated at one of feature peers 150 and may be processed separately. Inanother alternative, due to modification of a feature header via featurepeers 150 in response to changing conditions and/or session signaling,packets to/from the same user device may traverse a different set offeature peers 150, traverse feature peers 150 in a different order,and/or receive different processing by feature peers 150 in response tothe modified feature header.

Although FIGS. 3A-3C show exemplary components of network portion 300,in other implementations, network portion 300 may contain fewer,different, differently arranged, or additional components than depictedin FIGS. 3A-3C. In still other implementations, one or more componentsof network portion 300 may perform one or more other tasks described asbeing performed by one or more other components of network portion 300.

FIGS. 4A and 4B illustrate diagrams of exemplary interactions amongcomponents of another exemplary portion 400 of network 100. Asillustrated, exemplary network portion 400 may include user device 110,access router 120 (e.g., including ACL table 302 and AFL table 304),network 140, and feature peers 150. User device 110, access router 120(e.g., including ACL table 302 and AFL table 304), network 140, and/orfeature peers 150 may include the features described above in connectionwith, for example, FIGS. 1-3C. ACL table 302 may include an IP sourceaddress (SA) field 402, a tunnel header (TH) field 404, and a variety ofentries associated with IP SA field 402 and TH field 404. AFL table 304may include an IP destination address (DA) field 406, a next hop (NH)field 408, and a variety of entries associated with IP DA field 406 andNH field 408.

As shown in FIG. 4A, user device 110 may provide packet 318 (e.g.,including IPH 320 and PL 322) to ACL table 302 of access router 120. Inone exemplary implementation, IPH 320 may include an IP source addressof “D,” and ACL table 302 may associate IP SA of “D” with a first tunnelheader (TH.1) associated with feature peer 150-1. ACL table 302 maydetermine a tunnel 410 for packet 318 based on the IP SA (e.g., “D”) ofIPH 320 (or based on other parameters). Access router 120 may add afirst tunnel header (TH.1) 412 to packet 318, and may forward packet 318(e.g., based on first tunnel header 412) to feature peer 150-1 viatunnel 410, as determined via the “TH.1” IP DA entry in AFL table 304.

Feature peer 150-1 may receive packet 318 from tunnel 410, and mayperform feature processing of packet 318. In one exemplaryimplementation, feature peer 150-1 may use distributed hash tables(DHTs) 414, 416, and 418 to determine how to process packet 318. In oneexample, a DHT function may not be performed for each packet, but may beperformed in an event-driven manner when feature peer 150 net statechanges (e.g., when a load crosses a threshold or when feature peer's150 active/in active state changes). Event-driven DHT lookup results maythen be locally cached for more efficient operation until a next eventoccurs.

DHT 414 may include an IP SA field, a feature net (FN) field, and avariety of entries associated with the IP SA field and the FN field. DHT416 may include fields associated with each feature peer (FP.x) in acolumn for each feature net (e.g., FN.1, FN.2, . . . , FN.k). DHT 418may include an index of a specific feature peer that identifies one ormore tunnel header (TH) fields, and to be used to forward a packet tothe feature peers. If a feature peer is to replicate packets to multipleother feature peers, there may be a separate TH entry in DHT 418. In oneexample, feature peer 150-1 may perform a lookup of DHT 414 based on theIP SA (e.g., “D”), or other parameters, associated with packet 318, andmay determine that the IP SA of “D” may be associated with a firstfeature network (FN.1). Feature peer 150-1 may perform a lookup of DHT416 based on the first feature network (FN.1) descriptor, and maydetermine a next feature peer (e.g., feature peer 150-2 (FP.2))associated with the first feature network (FN.1). Feature peer 150-1 mayuse the determined next feature peer (e.g., FP.2) as an index for DHT418 to determine the associated tunnel header (e.g., TH.2, per DHT 418)to define a tunnel 420 to feature peer 150-2 and to modify packet 318.For example, feature peer 150-1 may add a tunnel header 422 (e.g., TH.2)and a feature header 424-1 (e.g., FH.1) to packet 318. Tunnel header 422may define tunnel 420. Feature header 424-1 may include the firstfeature network ID (e.g., FN.1), an address associated with accessrouter 120, and subscriber information, and may be used by subsequentfeature peers 150. Feature peer 150-1 may then route packet 318 tofeature peer 150-2 via tunnel 420.

Feature peer 150-2 may receive packet 318 from tunnel 420, and mayperform feature processing of packet 318. In one exemplaryimplementation, feature peer 150-2 may use event-driven DHTs 426 and 428to determine how to process packet 318. DHT 426 may include fieldsassociated with each feature peer (FP.x) in a column for each featurenet (e.g., FN.1, FN.2, . . . , FN.k). DHT 428 may include an index of aspecific feature peer that identifies one or more tunnel header (TH)fields to be used to forward a packet to the feature peers. If a featurepeer is to replicate packets to multiple other feature peers, there maybe a separate TH entry in DHT 428. Feature peer 150-2 may perform alookup of DHT 426 based on the first feature network (FN.1) descriptor,and may determine a next feature peer (e.g., feature peer 150-3 (FP.3))associated with the first feature network (FN.1). Feature peer 150-2 mayuse the determined next feature peer (e.g., FP.3) as an index for DHT428 to determine the associated tunnel header (e.g., TH.3, per DHT 428)to define a tunnel 430 (as shown in FIG. 4B) to feature peer 150-3 andto modify packet 318. For example, feature peer 150-2 may add a tunnelheader 432 (e.g., TH.3 as shown in FIG. 4B), defining tunnel 430, topacket 318, and may or may not modify one or more fields associated withfeature header 424-1 (FH.1). Feature peer 150-2 may then route packet318 to feature peer 150-3 via tunnel 430.

As shown in FIG. 4B, feature peer 150-2 may modify feature header 424-1based on feature information 310 and/or feature peer information 316 tocreate a modified feature header 424-2 (e.g., FH.2) and the modifiedcustomer packet 318. In an exemplary implementation, feature peer 150-2may modify feature header 424-1 (e.g., to create feature header 424-2)based on changing conditions (e.g., load conditions, availability,change in session state based on provisioned policy, etc.) associatedwith other feature peers 150. In another exemplary implementation,feature peer 150-2 may modify feature header 424-1 (e.g., to createfeature header 424-2) based on session signaling associated with otherfeature peers 150. Feature header 424-2 may include the first featurenetwork ID (e.g., FN.1), an address associated with access router 120,and subscriber information, and may be used by subsequent feature peers150.

As further shown in FIG. 4B, feature peer 150-3 may receive packet 318from tunnel 430, and may perform feature processing of packet 318. Inone exemplary implementation, feature peer 150-3 may use event-drivenDHTs 434, 436, and 438 to determine how to process packet 318. DHT 434may include an IP SA field, a FN field, and a variety of entriesassociated with the IP SA field and the FN field. DHT 436 may includefields associated with each feature peer (FP.x) in a column for eachfeature net (e.g., FN.1, FN.2, . . . , FN.k). DHT 438 may include anindex of a specific feature peer that identifies one or more tunnelheader (TH) fields to be used to forward a packet to the feature peers.If a feature peer is to replicate packets to multiple other featurepeers, there may be a separate TH entry in DHT 438. Feature peer 150-3may perform a lookup of DHT 436 based on the first feature network(FN.1) descriptor, and may determine a next feature peer (e.g., featurepeer 150-4 (FP.4)) associated with the first feature network (FN.1).Feature peer 150-3 may use the determined next feature peer (e.g., FP.4)as an index for DHT 438 to determine the associated tunnel header (e.g.,TH.4, per DHT 438) to define a tunnel 440 to feature peer 150-4 and tomodify packet 318. For example, feature peer 150-3 may add a tunnelheader 442 (e.g., TH.4), defining tunnel 440, to packet 318, and may ormay not modify one or more fields associated with feature header 424-2(FH.2). Feature peer 150-3 may then route packet 318 to feature peer150-4 via tunnel 440.

Feature peer 150-3 may modify feature header 424-2 based on featureinformation 310 and/or feature peer information 316 to create a modifiedfeature header 424-3 (e.g., FH.3) and the modified customer packet 318.In an exemplary implementation, feature peer 150-3 may modify featureheader 424-2 (e.g., to create feature header 424-3) based on changingconditions (e.g., load conditions, availability, etc.) associated withother feature peers 150. In another exemplary implementation, featurepeer 150-3 may modify feature header 424-2 (e.g., to create featureheader 424-3) based on session signaling associated with other featurepeers 150. Feature header 424-3 may include the first feature network ID(e.g., FN.1), an address associated with access router 120, andsubscriber information, and may be used by subsequent feature peers 150.

Feature peer 150-4 may receive packet 318 from tunnel 440, and mayperform feature processing of packet 318. In one exemplaryimplementation, feature peer 150-4 may use event-driven DHTs 444 and 446to determine how to process packet 318. DHT 444 may include fieldsassociated with each feature peer (FP.x) in a column for each featurenet (e.g., FN.1, FN.2, . . . , FN.k). DHT 446 may include an index of aspecific feature peer that identifies one or more tunnel header (TH)fields to be used to forward a packet to the feature peers. If a featurepeer is to replicate packets to multiple other feature peers, there maybe a separate TH entry in DHT 446. Feature peer 150-4 may perform alookup of DHT 444 based on the first feature network (FN.1) descriptor,and may determine a next feature peer (e.g., “END”) associated with thefirst feature network (FN.1). Feature peer 150-3 may use the addressassociated with access router 120 (e.g., from feature header 424) as anindex for DHT 446 to determine a tunnel header (e.g., TH.5, per DHT 446)that defines a tunnel 448 to access router 120. For example, featurepeer 150-4 may add a tunnel header 450 (e.g., TH.5), defining tunnel448, to packet 318, and may remove feature header 424-3 (FH.3) frompacket 318. Feature peer 150-4 may then route packet 318 to accessrouter 120 (e.g., to AFL table 304 of access router 120) via tunnel 448.

As shown in FIG. 4B, access router 120 (e.g., via AFL table 304) mayidentify packet 318 received from tunnel 448 as decapsulated (DE), andmay utilize lookup information 452 to route packet 318 to its DA (e.g.,based on IP DA field 406 and NH field 408). In one example, lookupinformation 452 may include a longest prefix match in network 140. AFLtable 304 may use lookup information 452 to determine a next hop (e.g.,a destination address in network 140) for packet 318, and may forward(e.g., via a tunnel 454) packet 318 to the destination address (DA)associated with network 140, as indicated by reference number 456.

Although FIGS. 4A and 4B show exemplary components of network portion400, in other implementations, network portion 400 may contain fewer,different, differently arranged, or additional components than depictedin FIGS. 4A and 4B. In still other implementations, one or morecomponents of network portion 400 may perform one or more other tasksdescribed as being performed by one or more other components of networkportion 400. For example, feature peers 150 may be used to distributeadditional feature/subscriber information that may be omitted fromfeature header 424-1 of packet 318. Furthermore, although not shown inFIGS. 4A and 4B, a similar procedure may be used to implement a featurenet for packets received from network 140 that are addressed to aspecific user.

In one exemplary implementation, information contained in event-drivenDHTs 414/416 (e.g., provided in feature peer 150-1), event-driven DHT426 (e.g., provided in feature peer 150-2), event-driven DHTs 434/436(e.g., provided in feature peer 150-3), and event-driven DHT 444 (e.g.,provided in feature peer 150-4) may be provided by and/or continuouslyupdated by feature peer information 316 (FIG. 3B). Functions associatedwith feature peers 150 may change over time and in response to changingconditions and/or session signaling. Thus, continuously updated featurepeer information 316 may enable implementations described herein todynamically update traversal of feature peers 150 by packet 318.Furthermore, in one exemplary implementation, information about eachfeature net (e.g., FN.1, FN.2, . . . , FN.k) may include partialordering information (or no ordering information) such that traversal offeature peers 150 by packet 318 may occur in different orders or maychange in response loads and/or failures associated with feature peers150. In one example, traversal of feature peers 150 by packet 318 mayoccur in parallel and may include interactions between parallel streams.In an exemplary implementation, a distributed control plane may bedynamically executed between feature peers 150 to determine how toimplement and/or adapt each feature net (e.g., FN.1, FN.2, . . . ,FN.k).

In contrast to the star/flower arrangement and the service header-basedrouting arrangement, which require expensive changes to the softwareand/or hardware of the access router, implementations described hereindo not require changes to the software/hardware of access router 120.Furthermore, the feature header (e.g., feature headers 334-1, 334-2,334-3, 424-1, 424-2, and/or 424-3) described herein may includeinformation distributed by DHT/P2P technology, possibly in anevent-driven manner to optimize efficiency. Convergence time, adaptationto changes, and ability to rapidly respond to changes, associated withimplementations described herein, may be improved over centralizedarrangements, such as the star/flower arrangement and the serviceheader-based routing arrangement. Implementations described herein maycombine DHT/P2P and network-aware routing using application layertopology optimization, and may function across multiple feature peersowned by different service providers.

Implementations described herein may be used to support a variety ofservices and/or features, such as content delivery network (CDN)-relatedfeatures; caching, streaming server, and/or P2P native applications;encryption and/or decryption; changing wireless conditions (e.g., signalstrength, location, privacy, bit rate, battery life, etc.); load and/orother information (e.g., local weather, traffic conditions, third partyinformation, etc.); delivering service characteristics based onknowledge of user device 110; packet repair; VPN and/or Internet denialof service (DoS) detection and/or mitigation; sniffing packets andperforming actions on packets; phishing detection; usage meteringservices; etc.

FIGS. 5-8 are flow charts of an exemplary process 500 for modifying apeer-to-peer based feature network according to implementationsdescribed herein. In one implementation, process 500 may be performed byone of feature peers 150. In another implementation, some or all ofprocess 500 may be performed by another device or group of devices,including or excluding one of feature peers 150.

As shown in FIG. 5, process 500 may include communicating with otherfeature peers to obtain information associated with the other featurepeers (block 510), and receiving a customer packet that includes afeature header (block 520). For example, in implementations describedabove in connection with FIGS. 3A-3C, feature peers 150 may communicatewith each other to provide feature peer information 316 to other featurepeers 150. Feature peer information 316 may include identificationinformation; load information; path information; active/inactive statusinformation; session signaling; policy information; databaseinformation; etc. associated with feature peers 150; and subscriberinformation (e.g., information associated with customers or subscribersto peer-to-peer based feature network forwarding). Feature peer 150-1may modify packet 318 (e.g., received from a customer) by adding featureheader 334-1 to packet 318, and may forward the modified packet 318 tofeature peer 150-2 (e.g., via tunnel 332). Feature header 334-1 mayinclude a feature net ID, the subscriber information associated withpacket 318, an address associated with access router 120, etc. Featurepeer 150-2 may receive the modified packet 318 from feature peer 150-1,and may decapsulate packet 318 from tunnel 332.

As further shown in FIG. 5, process 500 may include modifying thefeature header, based on the information associated with the otherfeature peers, to create a modified customer packet (block 530), anddetermining, based on the feature peer information, which of the otherfeature peers can support a feature associated with the modifiedcustomer packet (block 540). For example, in implementations describedabove in connection with FIG. 3C, feature peer 150-2 may modify featureheader 334-1 based on feature information 310 and/or feature peerinformation 316 to create a modified feature header 334-2 and themodified customer packet 318. Feature peer 150-2 may determine (e.g.,based on feature peer information 316) which of the other feature peers150 can support a feature associated with packet 318 (e.g., a featureset forth in PL 322 of packet 318).

Returning to FIG. 5, process 500 may include selecting a set of otherfeature peers, from the determined other feature peers, for the modifiedcustomer packet to traverse (block 550), and forwarding, based on themodified feature header, the modified customer packet to one of thefeature peers in the set of other feature peers (block 560). Forexample, in implementations described above in connection with FIG. 3C,feature peer 150-2 may determine subscriber information associated withpacket 318, and may select a set of feature peers 150 (e.g., fromfeature peers 150 determined to support the feature associated withpacket 318) for packet 318 to traverse. Feature peer 150-2 may inspectfeature header 334-1 and feature information 310 (e.g., provided by NMS130 or by feature peer information 316) to determine feature processingoptions and a next feature peer (e.g., feature peer 150-3) to which toprovide packet 318. Feature peer 150-2 may alter a tunnel header (e.g.,tunnel header 328) of packet 318. Tunnel header 328 may be altered todefine a tunnel 336 to the next feature peer (e.g., feature peer 150-3),and may forward the modified packet 318 to feature peer 150-3 (e.g., viatunnel 336).

Process block 510 may include the process blocks depicted in FIG. 6. Asshown in FIG. 6, process block 510 may include receiving sessionsignaling associated with the other feature peers (block 600), receivingpolicy information associated with the other feature peers (block 610),and receiving database information associated with the other featurepeers (block 620).

For example, in implementations described above in connection with FIG.3B, feature peers 150 may communicate with each other to provide featurepeer information 316 to other feature peers 150. Feature peerinformation 316 may include identification information; loadinformation; path information; active/inactive status information;session signaling (e.g., signaling provided between feature peers 150during provisioning of packet 318); policy information (e.g.,information associated with policies, such as usage policies, bandwidthallocations, etc.); database information (e.g., information contained indatabases of feature peers 150, sizes of such databases, etc.); etc.associated with feature peers 150; and subscriber information (e.g.,information associated with customers or subscribers to peer-to-peerbased feature network forwarding). Feature peer information 316 mayenable feature peers 150 to define a set of feature net logic (e.g., aset of feature peers 150) that may be dynamically determined and selfcorrecting.

Process block 530 may include the process blocks depicted in FIG. 7. Asshown in FIG. 7, process block 530 may include modifying the featureheader of the customer packet based on changing conditions associatedwith the other feature peers (block 700), and/or modifying the featureheader of the customer packet based on session signaling associated withthe other feature peers (block 710). For example, in implementationsdescribed above in connection with FIG. 3C, feature peer 150-2 maymodify feature header 334-1 (e.g., to create feature header 334-2) basedon changing conditions (e.g., change in session state, etc.) associatedwith other feature peers 150. In one example, feature peer 150-2 maymodify feature header 334-1 (e.g., to create feature header 334-2) basedon session signaling associated with other feature peers 150.Modification of the feature header may cause a different feature net andhence packet 318 may traverse feature peers 150 in a different order ortraverse a different set of feature peers 150.

Process block 550 may include the process blocks depicted in FIG. 8. Asshown in FIG. 8, process block 550 may include ranking the determinedother feature peers based on the information associated with thedetermined other feature peers (block 800), and selecting the set ofother feature peers, for the customer packet to traverse, from theranked, determined other feature peers and based on the ranking (block810). For example, in implementations described above in connection withFIG. 3C, feature peer 150-1 may rank feature peers 150, determined tosupport the feature associated with packet 318, based on feature peerinformation 316. In one example, feature peer 150-1 may rank featurepeers 150 with less loads higher than feature peers 150 with more loads.Feature peer 150-1 may select the set of feature peers 150 (e.g., fromthe ranked feature peers 150 determined to support the featureassociated with packet 318) for packet 318 to traverse based on therankings.

Implementations described herein may include systems and/or methods thatmay modify a peer-to-peer based feature network based on changingconditions and/or session signaling. For example, in one implementation,a feature peer (e.g., a server that provides features and/or services,such as content-related services, security-related services, etc.) maycommunicate with other feature peers to obtain information associatedwith the other feature peers, which may or may not be associated with areceived packet (e.g., from a user or customer) that includes a featureheader. The feature peer may modify the feature header, based on theinformation associated with the other feature peers, to create amodified customer packet. The feature peer may determine, based on thefeature peer information, which of the other feature peers can support afeature associated with the modified customer packet. The feature peermay select a set of the other feature peers, from the determined otherfeature peers, for the modified customer packet to traverse. The featurepeer may forward, based on the modified feature header, the modifiedcustomer packet to one of the feature peers in the set of other featurepeers.

The foregoing description of implementations provides illustration anddescription, but is not intended to be exhaustive or to limit theinvention to the precise form disclosed. Modifications and variationsare possible in light of the above teachings or may be acquired frompractice of the invention.

For example, while series of blocks have been described with regard toFIGS. 5-8, the order of the blocks may be modified in otherimplementations. Further, non-dependent blocks may be performed inparallel.

It will be apparent that aspects, as described herein, may beimplemented in many different forms of software, firmware, and hardwarein the implementations illustrated in the figures. The actual softwarecode or specialized control hardware used to implement embodimentsdescribed herein is not limiting of the invention. Thus, the operationand behavior of the embodiments were described without reference to thespecific software code—it being understood that software and controlhardware may be designed to implement the embodiments based on thedescription herein.

Even though particular combinations of features are recited in theclaims and/or disclosed in the specification, these combinations are notintended to limit the disclosure of the invention. In fact, many ofthese features may be combined in ways not specifically recited in theclaims and/or disclosed in the specification.

No element, act, or instruction used in the present application shouldbe construed as critical or essential to the invention unless explicitlydescribed as such. Also, as used herein, the article “a” is intended toinclude one or more items. Where only one item is intended, the term“one” or similar language is used. Further, the phrase “based on” isintended to mean “based, at least in part, on” unless explicitly statedotherwise.

What is claimed is:
 1. A method, comprising: communicating, by a computing device, with feature peers, associated with a network, to obtain information associated with a feature provided by the feature peers; receiving, by the computing device and from a first access router, a packet that includes a header, the header including routing information that identifies a first set of the feature peers for providing the feature; determining, by the computing device and based on the obtained information, which of the feature peers support the feature; selecting, by the computing device and from the determined feature peers, a second set of the feature peers for the packet to traverse; modifying, by the computing device, the header to create a modified packet, the modified header identifying the second set of the feature peers; and forwarding, by the computing device and based on the modified header, the modified packet to one of the feature peers in the second set of the feature peers.
 2. The method of claim 1, where communicating with the feature peers includes one or more of: receiving session signaling associated with one or more of the feature peers; receiving policy information associated with one or more of the feature peers; or receiving database information associated with one or more of the feature peers.
 3. The method of claim 1, where selecting the second set of the feature peers includes at least one of: selecting the second set of the feature peers based on information identifying changing conditions associated with a state of one or more of the feature peers, the information identifying the changing conditions being included in the information associated with the feature; or selecting the second set of the feature peers based on session signaling associated with the one or more of the feature peers, the information associated with the feature peers including information associated with the session signaling.
 4. The method of claim 3, where the information identifying the changing conditions associated with the one or more of the feature peers includes one or more of: load information associated with the one or more of the feature peers, the load information indicating a change in a load of the one or more of the feature peers, availability information associated with the one or more of the feature peers, the availability information indicating a change in an availability of the one or more of the feature peers, policy information associated with the one or more of the feature peers, the policy information indicating a change in a policy associated with the one or more of the feature peers, or state information, the state information indicating the change in a state for the packet based on at least one of: provisioned information, or the session signaling.
 5. The method of claim 1, where selecting the second set of the feature peers includes: ranking the determined feature peers based on load balancing information included in the information associated with the feature; and selecting the second set of the feature peers, for the modified packet to traverse, from the determined feature peers based on ranking the determined feature peers.
 6. The method of claim 1, where determining which of the feature peers support the feature includes: determining which of the feature peers support the feature further based on information identifying the feature that is included in a payload of the packet.
 7. The method of claim 1, where the modified packet is provided to each of the feature peers in the second set of the feature peers in an order that is determined based on information included in the modified header.
 8. The method of claim 7, where a last feature peer, in the second set of the feature peers, provides the packet to a second access router associated with the network, the second access router being different from the first access router, and where the second access router forwards the packet to a destination address that is at least one of: provided in the network, or associated with a customer.
 9. The method of claim 1, where the modified header includes at least one of: a feature net identifier that identifies the set of feature peers for the modified packet to traverse, subscriber information that identifies a user of a user device that subscribes to the feature, or an originating access router identifier that identifies the computing device.
 10. The method of claim 1, where the feature includes one or more of: content-related services provided by the second set of feature peers, or security-related services provided by the second set of feature peers.
 11. A device, comprising: a memory to store instructions; and a processor to execute the instructions to: communicate with feature peers, associated with a network, to obtain information associated with a feature provided by the feature peers, receive, from a first access router, a packet that includes a header identifying a first set of the feature peers for providing the feature, determine a change in a session state associated with the packet based on the obtained information, determine, based on the obtained information, which of the feature peers support the feature, select, from the determined feature peers, a second set of feature peers for the packet to traverse, modify the header to created a modified packet, the modified header identifying the second set of feature peers, and forward, based on the modified header, the modified packet to one of the feature peers in the second set of feature peers, a last feature peer, in the set of feature peers, removing the modified header from the modified packet and providing the packet to a second access router that is different from the first access router.
 12. The device of claim 11, where the processor is further to execute the instructions to: process, based on the modified header, the modified packet prior to forwarding the modified packet.
 13. The device of claim 11, where, when communicating with the feature peers, the processor is further to execute the instructions to one or more of: receive session signaling associated with one or more of the feature peers, receive policy information associated with one or more of the feature peers, or receive database information associated with one or more of the feature peers.
 14. The device of claim 11, where, when selecting the second set of feature peers, the processor is further to execute the instructions to at least one of: select the second set of feature peers based on changing load conditions associated with one or more of the feature peers, or select the second set of feature peers based on session signaling associated with one or more of the feature peers, the session signaling indicating the change in the session state.
 15. The device of claim 14, where the changing load conditions associated with one or more of the feature peers include information identifying a change in a security policy associated with the one or more of the feature peers.
 16. The device of claim 11, where, when selecting the second set of feature peers, the processor is further to execute the instructions to: rank the determined feature peers based on the obtained information, and select the second set of feature peers, for the modified packet to traverse, based on ranking the determined feature peers.
 17. The device of claim 11, where, when determining which of the feature peers support the feature, the processor is further to execute the instructions to: determine which of the feature peers support the feature further based on information identifying the feature that is included in a non-header portion of the packet.
 18. The device of claim 11, where the modified packet is provided to each of the feature peers in the second set of feature peers.
 19. The device of claim 11, where the modified header includes: a feature net identifier used to identify the second set of feature peers for the modified packet to traverse, subscriber information that identifies a user of a user device associated with a transmission of the packet to the first access router, the user subscribing to the feature, and an originating access router identifier that identifies the first access router.
 20. The device of claim 11, where one feature peer, in the second set of feature peers, is to at least one of: forward the packet to a destination address provided in the network, forward the packet to a destination address associated with a customer, or drop the packet before the packet reaches: the destination address provided in the network, or the destination address associated with the customer.
 21. A network device comprising: a processor to: communicate with feature peers, associated with a network, to obtain information associated with a feature provided by the feature peers; receive a packet that includes a feature header that identifies a first set of the feature peers for providing the feature; determine a change in a session state of the packet based on the obtained information, determine, based on the obtained information associated with the feature, which of the feature peers support the feature; select, from the determined feature peers, a second set of feature peers for the packet to traverse; modify the feature header to create a modified packet, the modified feature header identifying the second set of feature peers; and forward, based on the modified feature header, the modified packet to one of the feature peers in the second set of feature peers. 